A Poset Classifying Non-commutative Term Orders
نویسنده
چکیده
We study a poset N on the free monoid X∗ on a countable alphabet X. This poset is determined by the fact that its total extensions are precisely the standard term orders on X ∗. We also investigate the poset classifying degree-compatible standard term orders, and the poset classifying sorted term orders. For the latter poset, we give a Galois coconnection with the Young lattice.
منابع مشابه
Standard Paths in Another Composition Poset
Bergeron, Bousquet-Mélou and Dulucq [1] enumerated paths in the Hasse diagram of the following poset: the underlying set is that of all compositions, and a composition μ covers another composition λ if μ can be obtained from λ by adding 1 to one of the parts of λ, or by inserting a part of size 1 into λ. We employ the methods they developed in order to study the same problem for the following p...
متن کاملSaturated chains in composition posets
We study some poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The resulting poset N was studied by the author in [5] in relation to non-commutative term orders, and then in [6], where some results about generating functions for standard path...
متن کاملThe infinitesimal Hopf algebra and the poset of planar forests
We introduce an infinitesimal Hopf algebra of planar trees, generalising the construction of the non-commutative Connes-Kreimer Hopf algebra. A nondegenerate pairing and a dual basis are defined, and a combinatorial interpretation of the pairing in terms of orders on the vertices of planar forests is given. Moreover, the coproduct and the pairing can also be described with the help of a partial...
متن کاملEmbedding theorems for classes of GBL-algebras
The poset product construction is used to derive embedding theorems for several classes of generalized basic logic algebras (GBL-algebras). In particular it is shown that every n-potent GBL-algebra is embedded in a poset product of finite n-potent MV-chains, and every normal GBL-algebra is embedded in a poset product of totally ordered GMV-algebras. Representable normal GBLalgebras have poset p...
متن کاملThe Isomorphism Relation Between Tree-Automatic Structures
An ω-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for ω-tree-automatic structures. We prove first that the isomorphism relation for ω-treeautomatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative gro...
متن کامل